The Parity Problem for Reducible Cubic Forms
نویسنده
چکیده
This conjecture can be traced to Chowla ([2], p. 96); it is closely related to the Bunyakovsky/Schinzel conjecture on primes represented by irreducible polynomials. The one-variable analogue of (1.2) is classical for deg f = 1 and quite hopeless for deg f > 1. We know (1.2) itself when deg f ≤ 2. (The main ideas of the proof go back to de la Vallée-Poussin ([5], [6]); see [10], §3.3, for an exposition.) The problem of proving (1.2) when deg f ≥ 3 has remained open until now: sieving is forestalled by the parity problem ([16]), which Chowla’s conjecture may be said to embody in its pure form. We prove (1.2) for f reducible of degree 3. In a companion paper ([11]), we prove (1.2) for f irreducible of degree 3. Part of the importance of Chowla’s conjecture resides in its applications to problems of parity outside analytic number theory. Knowing that (1.2) holds for deg f = 3 allows us to conclude that in certain one-parameter families of elliptic curves the root number W (E) = ±1 averages to 0 ([8], Proposition 5.6). In §5, we will show that the two-parameter family y = x(x + a)(x + b) has average root number 0 as well. In the process, we will see that, for some f , (1.2) is robust under certain twists by characters to variable moduli.
منابع مشابه
The divisor problem for binary cubic forms
We investigate the average order of the divisor function at values of binary cubic forms that are reducible over Q and discuss some applications. Mathematics Subject Classification (2000). 11N37 (11D25).
متن کاملThe Parity Problem for Irreducible Cubic Forms
This conjecture can be traced to Chowla ([1], p. 96). It is closely related to the Bunyakovsky– Schinzel conjecture on primes represented by irreducible polynomials. The one-variable analogue of (1.1) is classical for deg f = 1 and quite hopeless for deg f > 1. We know (1.1) itself when deg f ≤ 2. (The main ideas of the proof go back to de la Vallée-Poussin ([3], [4]); see [11], §3.3, for an ex...
متن کاملThe Minimal Disagreement Parity Problem as a Hard Satisfiability Problem
One common approach to generating hard instances for SAT algorithms is to encode other NP-complete problems into SAT. An obvious problem with this approach is that many NP-complete problems are trivially solvable in the average case [4]. One solution to this problem is to choose problem classes which are randomly self-reducible. As we show in section 3, randomly self-reducible problems are as h...
متن کامل[inria-00630456, v3] The cactus rank of cubic forms
We prove that the smallest degree of an apolar 0-dimensional scheme of a general cubic form in n+1 variables is at most 2n+2, when n ≥ 8, and therefore smaller than the rank of the form. For the general reducible cubic form the smallest degree of an apolar subscheme is n+ 2, while the rank is at least 2n.
متن کاملOn Parameterizations of Rational Orbits of Some Forms of Prehomogeneous Vector Spaces
In this paper, we consider the structure of rational orbit of some prehomogeneous vector spaces originally motivated by Wright and Yukie. After we give a refinement of WrightYukie’s construction, we apply it to the inner forms of the D5 and E7 types. Parameterizations of reducible algebras for the cubic cases are included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005